Faster deterministic integer factorization
نویسندگان
چکیده
منابع مشابه
Faster deterministic integer factorization
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(Mint(N 1/4 logN)), where Mint(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan–Gaudry–Schost, following the Pollard–Strassen approach. We show that this bound can be improved by a factor of √
متن کاملDeterministic Integer Factorization Algorithms
This note presents a deterministic integer factorization algorithm of running time complexity O(N), ε > 0. This improves the current performances of deterministic integer factorization algorithms rated at O(N) arithmetic operations. Equivalently, given the least (log N)/6 bits of a factor of N = pq, where p and q are primes, the algorithm factors the integer in polynomial time O(log(N)), c ≥ 0 ...
متن کاملInteger factorization
“The problem of distinguishing prime numbers from composite numbers, and of resolving the latter into their prime factors, is known to be one of the most important and useful in arithmetic,” Gauss wrote in his Disquisitiones Arithmeticae in 1801. “The dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and so celebrated.”...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملFaster truncated integer multiplication
Let n > 1 and let u and v be integers in the interval 0 6 u, v < 2. We write M(n) for the cost of computing the full product of u and v, which is just the usual 2n-bit product uv. Unless otherwise specified, by ‘cost’ we mean the number of bit operations, under a model such as the multitape Turing machine [12]. In this paper we are interested in two types of truncated product. The low product o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2013
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2013-02707-x